A matrix model for plane partitions
نویسنده
چکیده
We construct a matrix model equivalent (exactly, not asymptotically), to the random plane partition model, with almost arbitrary boundary conditions. Equivalently, it is also a random matrix model for a TASEP-like process with arbitrary boundary conditions. Using the known solution of matrix models, this method allows to find the large size asymptotic expansion of plane partitions, to ALL orders. It also allows to describe several universal regimes. On the algebraic geometry point of view, this gives the Gromov-Witten invariants of C with branes, i.e. the topological vertex, in terms of the symplectic invariants of the mirror’s spectral curve.
منابع مشابه
A matrix model for plane partitions and TASEP
We construct a matrix model equivalent (exactly, not asymptotically), to the random plane partition model, with almost arbitrary boundary conditions. Equivalently, it is also a random matrix model for a TASEP with arbitrary boundary conditions. Using the known solution of matrix models, this method allows to find the large size asymptotic expansion of plane partitions, to ALL orders. It also al...
متن کاملA Connection between Alternating Sign Matrices and Totally Symmetric Self-Complementary Plane Partitions
We give a lattice path interpretation for totally symmetric self-complementary plane partitions. This is a first step in solving the long standing problem of enumerating such plane partitions. Another outstanding problem in enumerative combinatorics is the search for a bijection between alternating sign matrices and totally symmetric self-complementary plane partitions. From the lattice path in...
متن کاملAlternating Sign Matrices and Descending Plane Partitions
An alternating sign matrix is a square matrix such that (i) all entries are 1,-1, or 0, (ii) every row and column has sum 1, and (iii) in every row and column the nonzero entries alternate in sign. Striking numerical evidence of a connection between these matrices and the descending plane partitions introduced by Andrews (Invent. Math. 53 (1979), 193-225) have been discovered, but attempts to p...
متن کاملSymmetries of Plane Partitions and the Permanent - Determinant Method
In the paper [13], Stanley gives formulas for the number of plane partitions in each of ten symmetry classes. This paper together with the two papers [1] and [14] completes the project of proving all ten formulas. We enumerate cyclically symmetric, self-complementary plane partitions. We first convert plane partitions to tilings of a hexagon in the plane by rhombuses, or equivalently to matchin...
متن کاملRandom Sampling of Plane Partitions
This article presents uniform random generators of plane partitions according to the size (the number of cubes in the 3D interpretation). Combining a bijection of Pak with the method of Boltzmann sampling, we obtain random samplers that are slightly superlinear: the complexity is O(n(lnn)3) in approximate-size sampling and O(n4/3) in exact-size sampling (under a real-arithmetic computation mode...
متن کامل